Optimizing Berth Allocation in Maritime Transportation with Quay Crane Setup Times Using Reinforcement Learning
نویسندگان
چکیده
Maritime transportation plays a critical role in global trade as it accounts for over 80% of all merchandise movement. Given the growing volume maritime freight, is vital to have an efficient system handling ships and cargos at ports. The current first-come-first-serve method insufficient maintaining operational efficiency, especially under complicated conditions such parallel scheduling with different cargo setups. In addition, face rising demand, data-driven strategies are necessary. To tackle this issue, paper proposes mixed-integer model allocating quay cranes, terminals, berths. It considers not only types, but also time required crane setup. proposed features greedy-insert-based offline algorithm that optimizes berth allocation when vessel information available. situations where uncertain, utilizes online optimization strategy based on reinforcement-learning capable learning from feedback adapting quickly real time. results numerical experiments demonstrate both algorithms can significantly enhance efficiency overall harbor operation. Furthermore, they potential be extended other complex settings.
منابع مشابه
Simultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
In this work, we focus on the integrated planning of the following problems faced within the context of seaside operations at container terminals: berth allocation, quay crane assignment, and quay crane scheduling. First, we formulate a new binary integer linear program for the integrated solution of the berth allocation and quay crane assignment problems called BACAP. Then we extend it by inco...
متن کاملRobust Scheduling for Berth Allocation and Quay Crane Assignment Problem
Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule. To overcome this issue, a robust model and a proactive approach are presented for ...
متن کاملA Genetic Algorithm for Berth Allocation and Quay Crane Assignment
Container terminals are facilities where cargo containers are transshipped between different transport vehicles, for onward transportation. They are open systems that carry out a large number of different combinatorial problems that can be solved by means of Artificial Intelligence techniques. In this work, we focus our attention on scheduling a number of incoming vessels by assigning to each a...
متن کاملOptimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals
We focus on the integrated seaside operations in container terminals, namely the integration of berth allocation, quay crane assignment and quay crane scheduling problems. We first develope a mixed-integer linear programming formulation. Then, we propose an efficient cutting plane algorithm based on a decomposition scheme. Our approach deals with berthing positions of the vessels and their assi...
متن کاملThe Berth Allocation and Quay Crane Assignment Problem Using a CP Approach
This paper considers the combination of berth and crane allocation problems in container terminals. We propose a novel approach based on constraint programming able to model many realistic operational constraints. The costs for berth allocation, crane allocation, time windows, breaks and transition times during gang movements are optimized simultaneously. The model is based on a resource view w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Marine Science and Engineering
سال: 2023
ISSN: ['2077-1312']
DOI: https://doi.org/10.3390/jmse11051025